Parameterizing Meshes with Arbitrary Topology

نویسندگان

  • Swen Campagna
  • Hans-Peter Seidel
چکیده

Parameterizing meshes is a basic requirement for many applications, including, e.g., reverse engineering , texture mapping, and re-meshing. We present a new fast algorithm that uses the hierarchical representation of a polygonal mesh with arbitrary topology for generating a geometry-driven parameterization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generation of Generalized Meshes by Extrusion from Surface Meshes of Arbitrary Topology

A novel algorithm to extrude smooth, near-body volume meshes from surface meshes of arbitrary topology is presented. These meshes are classified as generalized meshes because multiple element topologies may be present within the same mesh. The algorithm utilizes a three-step, parabolic scheme based on the Poisson equation used in structured grid generation to extrude the volume mesh. Several pr...

متن کامل

Generation of Volume Meshes by Extrusion from Surface Meshes of Arbitrary Topology

An algorithm to generate volume meshes by extrusion from surface meshes of arbitrary topology is presented. The algorithm utilizes a three-step, advancing layer scheme to extrude a smooth volume mesh starting from an initial surface mesh. First, a locally orthogonal reference mesh is algebraically generated for the layer. The reference mesh is then smoothed using a locally three-dimensional Poi...

متن کامل

One-Forms on Meshes and Applications to 3D Mesh Parameterization

We develop a theory of one-forms on meshes. The theory culminates in a discrete analog of the Poincare-Hopf index theorem for meshes. We apply this theorem to obtain some old and new results concerning the parameterization of 3D mesh data. Our first result is an easy proof of Tutte's celebrated "spring-embedding" theorem for planar graphs, which is widely used for parameterizing meshes with the...

متن کامل

A Colour Interpolation Scheme for Topologically Unrestricted Gradient Meshes

Gradient meshes are a 2D vector graphics primitive where colour is interpolated between mesh vertices. The current implementations of gradient meshes are restricted to rectangular mesh topology. Our new interpolation method relaxes this restriction by supporting arbitrary manifold topology of the input gradient mesh. Our method is based on the Catmull-Clark subdivision scheme, which is well-kno...

متن کامل

Discrete one-forms on meshes and applications to 3D mesh parameterization

We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an easy proof of Tutte’s celebrated “springembedding” theorem for planar graphs, which is widely used for parameterizing meshes with the topology of a disk as a planar embedding with a convex boundary. Our second result gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998